#include <bits/stdc++.h>


using namespace std;
const int N = 205;
typedef long long LL;
int arr[N][N];
map<double, char> M;
void dfs(int c, int n, double sum) {
    if (c > n) {
        M[sum] = 'T';
        return ;
    }
    dfs(c + 1, n, sum + c);
    dfs(c + 1, n, sum + c / 2.0);
}
signed main() {

    int n, t;
    LL min = 1000000000000000;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> n >> t;
    for (int i = n * n; i; -- i) {
        LL num;
        cin >> num;

    } 
    __builtin_popcountll();
    return 0;
}